The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection
نویسندگان
چکیده
The ComBack method is a memory reduction technique for explicit state space search algorithms. It enhances hash compaction with state reconstruction to resolve hash conflicts on-the-fly thereby ensuring full coverage of the state space. In this paper we provide two means to lower the run-time penalty induced by state reconstructions: a set of strategies to implement the caching method proposed in [18], and an extension through delayed duplicate detection that allows to group reconstructions together to save redundant work.
منابع مشابه
A New Method for Duplicate Detection Using Hierarchical Clustering of Records
Accuracy and validity of data are prerequisites of appropriate operations of any software system. Always there is possibility of occurring errors in data due to human and system faults. One of these errors is existence of duplicate records in data sources. Duplicate records refer to the same real world entity. There must be one of them in a data source, but for some reasons like aggregation of ...
متن کاملCommunication Strategies Revisited: Looking beyond Interactional and Psycholinguistic Perspectives
Second language (L2) communication strategies (CSs) have traditionally been dealt with through either interactional or psychological perspectives. However, this paper is a critical attempt to question the status of the particular kinds of psycholinguistic and interactional approaches that currently dominate the field of second language acquisition (SLA). In this way, it expands the significance...
متن کاملMetacognitive Listening Strategy Use Revisited in the Light of Learners' Emotional Intelligence
The current study was after probing the would-be correlation between emotional intelligence (and its subcomponents), on the one hand, and metacognitive listening strategies used by academic EFL learners, on the other. Benefiting from 72 female and 40 male university students from Urmia University, Urmia Azad University and Salams Azad University, the current study also strived to find the possi...
متن کاملThe ComBack Method - Extending Hash Compaction with Backtracking
This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state space is guaranteed. Each encountered state is mapped into a compressed state descriptor (hash value) as in hash compaction. The method additionally stores for each state an integer representing the identity of the sta...
متن کاملApproximate Joins for Relational Data
Krommydas, Ioannis, Evagelos, Georgia. MSc, Computer Science Department, University of Ioannina, Greece. June, 2008. Approximate Joins for Relational Data. Thesis Supervisor: Vassiliadis Panos. Relational databases often contain duplicate data entries. This may occur due to a variety of reasons, such as typographical errors, multiple conventions for recording database fields or other noise sour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Trans. Petri Nets and Other Models of Concurrency
دوره 3 شماره
صفحات -
تاریخ انتشار 2009